The STC104 Packet Routing Chip

Packet Routing on the Grid

The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with important practical applications, e.g., in traffic routing, parallel computing, and the design of communication protocols. The problem involves critical routing and scheduling decisions. One has to determine a suitable (sh...

The mathematics of packet routing

You should always keep in mind that IPv4 (the current internet protocol) has no concept of route. That is to say, a packet of data does not specify its route and routers (unless they are running a special protocol) do not store the comnplete route from themselves to a desination but only the next “hop” that is on that route (that is only enough information to know where a packet should be sent ...

Packet routing and scheduling

Packet Routing in Fixed

We survey routing problems on xed-connection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, k-relation routing, routing to random destinations , dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We also provide a list of unsolved problems an...

Packet Routing via Min-Cost Circuit Routing

In this paper we initiate the study of competitive on-line packet routing algorithms. At any time, any network node may initiate sending a packet to another node. Our goal is to route these packets through the network, while simultaneously minimizing link bandwidth, buffer usage, and the average delay of a packet. We give efficient centralized on-line packet routing algorithms in this setting. ...